Towards Optimal Parallel PM N-body Codes: PMFAST

نویسنده

  • Hugh Merz
چکیده

We present a new parallel PM N-body code named PMFAST that is freely available to the public. PMFAST is based on a two-level mesh gravity solver where the gravitational forces are separated into long and short range components. The decomposition scheme minimizes communication costs and allows tolerance for slow networks. The code approaches optimality in several dimensions. The force computations are local and exploit highly optimized vendor FFT libraries. It features minimal memory overhead, with the particle positions and velocities being the main cost. The code features support for distributed and shared memory parallelization through the use of MPI and OpenMP respectively. The current release version uses two grid levels on a slab decomposition, with periodic boundary conditions for cosmological applications. Open boundary conditions could be added with little computational overhead. We present timing information and results from a recent cosmological production run of the code using a 3712 mesh with 6.4 × 10 particles. PMFAST is cost-effective, memory-efficient, and is publicly available.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Linear Codes Over GF(7) and GF(11) with Dimension 3

Let $n_q(k,d)$ denote the smallest value of $n$ for which there exists a linear $[n,k,d]$-code over the Galois field $GF(q)$. An $[n,k,d]$-code whose length is equal to $n_q(k,d)$ is called {em optimal}. In this paper we present some matrix generators for the family of optimal $[n,3,d]$ codes over $GF(7)$ and $GF(11)$. Most of our given codes in $GF(7)$ are non-isomorphic with the codes pre...

متن کامل

Constructions of skew-tolerant and skew-detecting codes

[l] T.A. Gulliver and V.K. Bhargava, “Some best rate l / p and rate (p l ) / p systematic quasi-cyclic codes,” IEEE Trans. Inform. Theory, vol. IT-37, pp. 552-555, May 1991. [2] T.A. Gulliver and V.K. Bhargava, “Nine good rate (m l) /pm quasicyclic codes,” IEEE Trans. Inform. Theory, vol. IT-38, pp. 1366-1369, July 1992. [3] G.E. S6guin and G. Drolet, “The theory of 1-generator quasi-cyclic cod...

متن کامل

Generating Binary Optimal Codes Using Heterogeneous Parallel Computing

Generation of optimal codes is a well known problem in coding theory. Many computational approaches exist in the literature for finding record breaking codes. However generating codes with long lengths n using serial algorithms is computationally very expensive, for example the worst case time complexity of a Greedy algorithm is O(n 4). In order to improve the efficiency of generating codes wit...

متن کامل

COSMOS: A Hybrid N-Body/Hydrodynamics Code for Cosmological Problems

We describe a new hybrid N -body/hydrodynamical code based on the particle-mesh (PM) method and the piecewise-parabolic method (PPM) for use in solving problems related to the evolution of large-scale structure, galaxy clusters, and individual galaxies. The code, named COSMOS, possesses several new features which distinguish it from other PM-PPM codes. In particular, to solve the Poisson equati...

متن کامل

Approximating Huffman Codes in Parallel

In this paper we present some new results on the approximate parallel construction of Huuman codes. Our algorithm achieves linear work and logarithmic time, provided that the initial set of elements is sorted. This is the rst parallel algorithm for that problem with the optimal time and work. Combining our approach with the best known parallel sorting algorithms we can construct an almost optim...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005